#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

inline void solution()
{
    string a;
    cin >> a;
    long long num[2] = {0, 0};
    for (int i = 0; i < a.length(); i++)
        num[i & 1] = num[i & 1] * 10 + a[i] - '0';
    cout << (num[0] + 1) * (num[1] + 1) - 2 << endl;
}

int main()
{
    // freopen("input.txt", "r", stdin);
    quickread();
    int T;
    cin >> T;
    while (T--)
    {
        solution();
    }
    return 0;
}